Need explanation on theorem form the book [closed]

Posted by Pradeep on Programmers See other posts from Programmers or by Pradeep
Published on 2012-12-09T17:28:53Z Indexed on 2012/12/09 23:42 UTC
Read the original article Hit count: 285

Filed under:

algorithm-analysis

I need some explanation on amortization analysis with respect to analysis of algorithm. I need some more explanation on one of the theorem attached. Explanation needed: 1. How did the author derive at Mij is O (ij-ij-1)? 2. Need explanation for quoted from the book " because at most ij-ij-1 -1 elements have been added into the table since the clear operation Mij-1 or since the beginning of the series." 3. Also what does the summation equation mean? need some more thorough explanation and the essence of the theorem.

Removed ~~Attached is the scan copy of the page from the Book~~

Related posts about algorithm-analysis

Algorithm Analysis tool for java

as seen on Stack Overflow - Search for 'Stack Overflow'
I am looking for an algorithm analysis tool for java that can calculate Big 0 of a function. Ideal I would like to make it part of my build process, along side of my other code metrics tool. Even after searching on google I am unable to find any opensource of commercial tool. Any suggestion would… >>> More
algorithm analysis - orders of growth question

as seen on Stack Overflow - Search for 'Stack Overflow'
I'm studing orders of growth "big oh", "big omega", and "big theta". Since I can't type the little symbols for these I will denote them as follows: ORDER = big oh OMEGA = big omega THETA = big theta For example I'll say n = ORDER(n^2) to mean that the function n is in the order of n^2 (n grows… >>> More
Sublinear Extra Space MergeSort

as seen on Programmers - Search for 'Programmers'
I am reviewing basic algorithms from a book called Algorithms by Robert Sedgewick, and I came across a problem in MergeSort that I am, sad to say, having difficulty solving. The problem is below: Sublinear Extra Space. Develop a merge implementation that reduces that extra space requirement… >>> More
Help with algorithmic complexity in custom merge sort implementation

as seen on Programmers - Search for 'Programmers'
I've got an implementation of the merge sort in C++ using a custom doubly linked list. I'm coming up with a big O complexity of n^2, based on the merge_sort() slice operation. But, from what I've read, this algorithm should be n*log(n), where the log has a base of two. Can someone help me determine… >>> More
How meaningful is the Big-O time complexity of an algorithm?

as seen on Programmers - Search for 'Programmers'
Programmers often talk about the time complexity of an algorithm, e.g. O(log n) or O(n^2). Time complexity classifications are made as the input size goes to infinity, but ironically infinite input size in computation is not used. Put another way, the classification of an algorithm is based on a… >>> More

Developer IT